package com.lzq.leetcode.hoot100;

import java.util.Arrays;

public class s64 {
    public int minPathSum(int[][] grid) {
        int m = grid.length;
        int n = grid[0].length;
        int[][] dp = new int[m+1][n+1];

        Arrays.fill(dp[0], Integer.MAX_VALUE);
        for (int i=0; i<=m; i++) {
            dp[i][0] = Integer.MAX_VALUE;
        }
        dp[0][1] = 0;

        for (int i=1; i<=m; i++) {
            for (int j=1; j<=n; j++) {
                dp[i][j] = Math.min(dp[i-1][j], dp[i][j-1]) + grid[i-1][j-1];
            }
        }
        return dp[m][n];
    }

    public static void main(String[] args) {
        s64 s64 = new s64();
        System.out.println(s64.minPathSum(new int[][]{{1, 2}, {1, 1}}));
    }
}
